-
1 disprovable formula
Большой англо-русский и русско-английский словарь > disprovable formula
-
2 disprovable formula
Математика: невыводимая формула -
3 disprovable formula
мат. -
4 formula
1) рецепт2) формула || формульный3) формулировка•- arithmetically valid formula - back interpolation formula - computational formula - computing formula - corrector formula - formally decidable formula - formally refutable formula - formula of finite increments - geometrically valid formula - homomorphically stable formula - identically false formula - identically true formula - intuitionistically valid formula - logically valid formula - maximum likelihood formula - modally valid formula - monotonically increasing formula - numeralwise expressible formula - numeralwise representable formula - positively valid formula - primitively recursive formula - reciprocity formula - secondarily valid formula - square stable formula - universally valid formulato follow the formula — подчиняться [следовать] формуле; описываться формулой
-
5 невыводимая формула
disprovable formula мат., underivable formulaРусско-английский научно-технический словарь Масловского > невыводимая формула
-
6 невыводимая формула
Большой англо-русский и русско-английский словарь > невыводимая формула
-
7 невыводимая формула
Mathematics: disprovable formula, underivable formulaУниверсальный русско-английский словарь > невыводимая формула
См. также в других словарях:
Proof sketch for Gödel's first incompleteness theorem — This article gives a sketch of a proof of Gödel s first incompleteness theorem. This theorem applies to any formal theory that satisfies certain technical hypotheses which are discussed as needed during the sketch. We will assume for the… … Wikipedia
Mathematical proof — In mathematics, a proof is a convincing demonstration (within the accepted standards of the field) that some mathematical statement is necessarily true.[1][2] Proofs are obtained from deductive reasoning, rather than from inductive or empirical… … Wikipedia
Gödel's incompleteness theorems — In mathematical logic, Gödel s incompleteness theorems, proved by Kurt Gödel in 1931, are two theorems stating inherent limitations of all but the most trivial formal systems for arithmetic of mathematical interest. The theorems are of… … Wikipedia
Theorem — The Pythagorean theorem has at least 370 known proofs[1] In mathematics, a theorem is a statement that has been proven on the basis of previously established statements, such as other theorems, and previously accepted statements … Wikipedia
Teleological argument — A teleological or design argument[1][2][3] is an argument for the existence of God. The argument is based on an interpretation of teleology wherein purpose and intelligent design appear to exist in Nature beyond the scope of any such human… … Wikipedia
Existence of God — Part of a series on God General conceptions … Wikipedia